Circuit Macro Placement Using Macro Aspect Ratio Based on Ports

ABSTRACT

Fixed outline shaped and modifiable outline shaped random logic macros of an electronic circuit design are manipulated by modifying an outline of a modifiable outline shape macro based on criteria consisting of any one of a macro port weight value, a macro port ordering; a macro rapport constraint or a macro logic depth and placing resulting macros at locations on an integrated circuit (chip).

TECHNICAL FIELD

The present invention relates to the placement and routing of electroniccircuit designs for integrated circuits, and, more specifically, to animproved computer-implemented method to create a legal placement ofrandom logic macros of an electronic circuit design, wherein said macroscan have a fixed or a modifiable outline and wherein the outline of amacro with a modifiable outline is automatically adjusted.

BACKGROUND OF THE INVENTION

In a hierarchical design approach, the logic of an integrated circuit(“IC”) or chip is partitioned into smaller portions that are assigned topredefined areas of the chip. These smaller design portions (which maycomprise area, logic, interconnects and timing assertions) are typicallyreferred to as macros. Usually, some logic will not be assigned to anymacro. This logic is considered as being on the top level of thehierarchy. It may well be that the hierarchy is nested and a chip ispartitioned into one or more units and each unit is partitioned into oneor more macros. The top level is typically referred to as a “unit” andthe lower level(s) as “macros”.

A port of a macro is the point (or small area) at which the internal andexternal signals are connected to each other. There are some guidelinesfrom the design team on which ports should be close to each other. Thesize of the macro as well as the x- and y-dimension of the macrooutlines are given and assumed to be fixed. During unit/chip placementthese fixed macro outlines are moved around to find the best legallocation non-overlapping and with minimum netlength between ports.Additional unit/chip blockages allow not all possible placements andlead to longer netlength.

SUMMARY

According to one embodiment of the present invention, a method and acorresponding computer program and a corresponding computer programproduct to create a legal placement of random logic macros of anelectronic circuit design, wherein said macros are categorized in macroswith a fixed or a modifiable outline and wherein the outline of a macrowith a modifiable outline is automatically adjusted, wherein theadjustment uses at least one of the following criteria:

macro port weights;

macro port ordering;

macro rapport constraints;

macro logic depth.

The invention allows improving macro utilization, package density ofmacros on the unit level, and path length. This offers cost reduction onthe chip level and performance improvements for electronic circuits.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an IC or chip having a top level unit andseveral lower level macros;

FIG. 2 is a block diagram of an IC or chip having a top level unit andseveral lower level macros with port assignments in accordance with afirst abstraction;

FIG. 3 is a flow diagram of the steps in a method for the firstabstraction of FIG. 2 in which the top level interconnects areoptimized;

FIG. 4 is a block diagram of a second abstraction;

FIG. 5 illustrates a clustering approach of splitting a sequence of nports within a macro into n−1 pair-wise clusters of ports;

FIG. 6 is a flow diagram of the steps in a method for the secondabstraction of FIG. 4 in which both the top level and the macrointerconnects are optimized;

FIG. 7, including FIGS. 7A and 7B, illustrates the distance and weightassigned to the connection between virtual inverters within a macro ofFIG. 4;

FIG. 8 illustrates an example of the weighting of the virtual nets ofFIG. 7;

FIG. 9 is a block diagram of a third abstraction;

FIG. 10 is a flow diagram of the steps in a method for the thirdabstraction of FIG. 9 in which the top level timing is optimized; and

FIG. 11 is a schematic block diagram of a general-purpose computersuitable for practicing embodiments of the present invention;

FIG. 12 is a flow diagram of the steps in a method in accordance withthe present invention;

FIG. 13 is a flow diagram of the steps in a partitioning method inaccordance with the present invention;

FIG. 14 is a block diagram illustrating the port ordering in accordanceto the invention;

FIG. 15 is a block diagram illustrating a vertical data flow dominatedmacro;

FIG. 16 is a block diagram illustrating foreign objects used inaccordance with the invention;

FIG. 17 is a block diagram illustrating logic depth binning inaccordance with the invention;

FIG. 18 is a block diagram illustrating logic depth binning based oncones from input ports to output ports accordance with the invention;

FIG. 19 is a block diagram illustrating the calculation of portpositions in accordance with the invention;

FIG. 20 is a block diagram illustrating port allocation for a macro inaccordance with the invention; and

FIG. 21 is a block diagram illustrating the outline for the macro ofFIG. 20 in accordance with the invention.

DETAILED DESCRIPTION Port Assignment in Hierarchical Designs byAbstracting Macro Logic

Referring to the block diagram of FIG. 1, in a hierarchical designapproach, the logic of an IC or chip 100 is partitioned into smallerportions that are assigned to predefined areas of the chip. Thesesmaller design portions (which may comprise area, logic, interconnects,timing assertions, etc.) are typically referred to as macros. Fourmacros (“Macro A”-“Macro D”) 102-108 are illustrated in FIG. 1, whereineach macro 102-108 is shown containing various combinational logiccircuits or components. The macros 102-108 also may contain sequentiallogic. Usually, some logic will not be assigned to any macro. This logicis considered as being on the top level of the hierarchy. It may well bethat the hierarchy is nested and a chip is partitioned into one or moreunits and each unit is partitioned into one or more macros. The toplevel is typically referred to as a “unit” and the lower level(s) as“macros”. One unit 110 is illustrated in FIG. 1. Also illustrated is aplurality of input/output ports 112 for the unit or chip and a pluralityof ports 114 for the various macros 102-108.

An embodiment of the present invention uses a method for port assignmentby abstracting local connections in the macro when performing portassignment for the macro. This is done for netlength, congestion as wellas timing. Specifically the internal netlist of the macro is abstractedsuch that the optimization of the port connections can be performed in arelatively efficient manner. Three levels of abstractions are used.

Referring to FIG. 2, there illustrated is a block diagram an IC or chip200 having a top level unit 202 and several lower level macros 204-210with port assignments in accordance with a first abstraction used in anembodiment of the invention. Each input and output circuit (FIG. 1) foreach macro 204-210 is replaced by a circuit component which, in anembodiment, comprises an inverter circuit 212. However, the circuitcomponents 212 may, in the alternative, comprise a buffer, a terminator,or a load book. The port assignment process now comprises placing orlocating the entire logic (i.e., the unit 202 and the inverters 212 orother components in each of the macros 204-210) such that netlength andcongestion are both minimized. Thus, this first abstraction optimizesthe top level interconnect. The area or point where the signal wireenters or leaves the macro 204-210 is where the port location 214 isassigned for each macro 204-210. Also illustrated is a plurality ofinput/output ports or ports 216 for the unit or chip 202.

The flow diagram of FIG. 3 illustrates the steps in a method 300 for thefirst abstraction in which the top level interconnects are optimized. Inthe method 300 of FIG. 3, in a step 302 the macro ports are replaced bythe virtual inverters 212 (FIG. 2) inside each macro 204-210. Also, theinternal logic within each macro 204-210 (FIG. 1) is removed. Theinverters 212 are then assigned to the corresponding macros 204-210 bymovebounds in a step 304. Next, a flat placement of the entireabstracted logic with movebounds is carried out in a step 306, and thenthe top level flat routing occurs in a step 308. Then, a step 310 takesplace which defines the ports where routing enters the macro area in x,y, z coordinates. Next, the macro internal logic is replaced in a step312 by the original macro logic.

Referring to FIG. 4, there illustrated is a block diagram of an IC 400having a top level unit 402 and several lower level macros 404-410 withport assignments in accordance with a second abstraction used in anembodiment of the invention. The first abstraction of FIG. 2 does notconsider the fact that port (a) 412 and port (b) 414 in FIG. 4 may belocated relatively close to each other as these two ports 412-414 areconnected to the same circuit within Macro B 406. This can be handled byany clustering method during the placement step. A typical clusteringmethod is to add a new artificial connection between the two inverters416 connected to port (a) 412 and port (b) 414. Also, a relatively highweight may be placed on the connection (e.g., a weight of 10 means thatthe placement minimizing the overall netlength weights this connection10 times higher than a connection or net without a special weightassigned). These connections may either be: (1) given by the logicdesigner, for example, to cluster multiple-bit signal busses, which isthe case when the macro logic is not available yet; or (2) derived froma previous logic analysis step of all the macros counting how manycircuits are in between the two ports 412-414, where in general, thelower this number the higher the weight to be chosen. The clusteringapproach may also be used to guide the port assignment to a certainsequencing of the ports. In these cases the relative ordering isimportant but mirroring may be allowed to optimize the globalconnections. This may be obtained by splitting a sequence of n ports502-510 within a macro 512 into n−1 pair-wise clusters 514-520 of portsas shown in FIG. 5.

The flow diagram of FIG. 6 illustrates the steps in a method 600 for thesecond abstraction used in an embodiment of the invention in which boththe top level interconnects and the macro interconnects are optimized.The method 600 of FIG. 6 is similar to the method 300 of FIG. 3, withthe exception of the addition of a step 604 in which virtual nets areadded to connect the virtual inverters according to the macro internalstructure. For example, see FIG. 7 in which Macro D 108 from FIG. 1 isshown in FIG. 7A above the abstracted Macro D 700 in FIG. 7B in whichthe virtual inverters 702 or other components within Macro D 700 have adistance and a weight assigned to the connection between these inverters702. An example of the weighting of the virtual nets is illustrated inFIG. 8. This figure illustrates that the weighting is typically given bythe number of stages (i.e., distance) between ports of a macro.

Referring to FIG. 9, there illustrated is a block diagram of an IC 900having a top level unit 902 and several lower level macros 904-910 withport assignments in accordance with a third abstraction used in anembodiment of the invention. The first and second abstractions describedhereinabove do not permit timing-driven optimization port assignment.This is because the removal of the macro logic breaks the timing pathsas seen by static timing analysis (“STA”) or similar tools. A standarddesign practice is to latch-bound macros for high frequency designs.Within this abstraction the inverters utilized within the first andsecond abstractions may be replaced by clocked latches or flip-flops912, which connect to clock signals such that STA tools can now timebetween the unit (or chip) input/output ports 914 and the macros. Eachtiming path starts and ends at either an input/output port or port 914or a latch 912. Clock overrides may be used to account for logic stagesbetween the latches 912 and the ports 916 that exist in the real logicof the macro 904-910.

The flow diagram of FIG. 10 illustrates the steps in a method 1000 forthe third abstraction used in an embodiment of the invention in whichthe top level timing is optimized. In the method 1000 of FIG. 10, in astep 1002 the macro ports are replaced by the virtual latches 912 (FIG.9) inside each macro 904-910. Also, the internal logic within each macro904-910 (FIG. 1) is removed. In an optional step 1004, the virtual netsare added to connect the virtual latches 912 according to the macrointernal structure (FIG. 7). The latches 912 are then assigned to thecorresponding macros 904-910 by movebounds in a step 1006. Next, a flattiming driven placement of the entire abstracted logic with moveboundsis carried out in a step 1008, and then the top level flat timing drivenrouting occurs in a step 1010. Then, a step 1012 takes place whichdefines the ports where routing enters the macro area in x, y, zcoordinates. Next, the macro internal logic is replaced in a step 1014by the original macro logic.

Modifiable Macros

The flow diagram of FIG. 12 illustrates the steps in a method inaccordance with the invention. Random logic macros and/or custom macrosare stored in a netlist 1200. The netlist 1200 is a hierarchical netlistof a design of an electronic circuit on the gate level and comprisesplacement information for the macros such as their size and the positionof the ports. Macros like arrays, register files and custom macros arealways fixed in size, boundary and ports and attributed by the designersas none-modifiable, based on constraints like dataflow, placementlocation or area allocation. Other macros are tagged by the designerwith one dimension of the boundary fixed based on known constraints likedataflow, placement location and area allocation. All other macros aremodifiable in all dimensions.

In step 1210 a macro will be selected from the netlist 1200 andcategorized. If the macro was categorized as a macro with fixedboundaries, then the processing of this macro will be finished in step1220. If the macro was categorized as a macro with modifiable outlineand pre-allocated ports, then the processing of the macro continues withstep 1260. If the macro was categorized as a macro with modifiableboundaries, then it will be determined in step 1230, if the logiccontent of this macro is already stored in the netlist 1200. If it isstored, then a special port allocation method will be performed for thismacro in step 1240. Otherwise a different port allocation method will beperformed for this macro in step 1250.

The special port allocation methods performed in steps 1240 and 1250 usethe port assignment methods described above to define the ports to theedges of the macro. Especially, for step 1250 the method shown in FIG. 4can be used. Once the ports are defined, the port allocation is based onthe distance weight between ports and signal names in the macro, whichis based on their distance as long as the macro logic content is notknown for the directional size. This port allocation approach is used instep 1250. For step 1240 the port allocation is based on distanceweight, port/signal names, same gate port staggering, and input tooutput distance weight.

The port allocation is illustrated in FIG. 14, where a large macro 1400and a small macro 1410 are shown. Macro 1400 and macro 1410 have amodifiable boundary and are connected to each other via a number ofports as shown in the area 1430. The large macro 1400 forces its portassignment onto the smaller macro 1410 in one direction within the area1430. This relationship is also called rapport. Generally, large macrosforce their port assignment onto smaller neighboring connected macros.

If the logic content of the macro 1400 is known, then it is possible todetermine, which ports on the input stage are connected to the same gateof the macro 1400. In FIG. 14, the ports in the area 1440 are in theinput stage of the macro 1400 and connected to the same gate 1450. Thisway it is possible to establish a port staggering at the input stage ofthe macro 1400 by staggering all ports that are connected to the samegates.

For each of these ports it is possible to count the number of stageswith logic elements between the input and output stage of the macro1400. This is also called the logic depth. For the staggered ports inthe area 1440 the logic depth is 3 as there are three logic elementsbetween the input and the output stage: the logic elements 1450, 1460,and 1470. This logic depth can be used as a measure for the orthogonalsize of the macro 1400.

In case the logic content for the macro 1400 is not known, then theports are allocated based on the distance weight between input ports andsignal names. For example, the distance between the ports in the area1450 is 2.

When steps 1240 or 1250 in FIG. 12 are completed, then a separatepartitioning method will be performed with the macro in step 1260. Thispartitioning method is illustrated in FIG. 13. The method in FIG. 12continues with step 1270 of FIG. 12. Step 1270 will determine if thedimension of the macro as defined by the partitioning method of FIG. 13in step 1260 is likewise with the dimension of a large neighbor macrowith fixed outline and given port sequence. If this is not the case,then the modified macro will replace the original macro in the netlist1200. Otherwise, the ports from the other macro in vicinity get stampedonto the macro (rapport) in step 1280. The resulting modifications tothe macro are then finally stored in the netlist 1200 again.

FIG. 15 illustrates a macro 1500, which is dominated by a vertical dataflow. This domination is caused by the horizontally allocated ports 1510and 1520, which dominate in relation to the vertically allocated ports1530. The area consumed by this macro on the IC or chip, its height andwidth are calculated as follows:

$\mspace{79mu} {{Area} = \frac{Logic\_ Area}{Utilization}}$Height = min (f₁(logic_depth), f₂(number_of_ports_in_y_direction))$\mspace{79mu} {{Width} = {\min\left( {\frac{Area}{Height},{f_{2}\left( {{number\_ of}{\_ ports}{\_ in}{\_ x}{\_ direction}} \right)}} \right.}}$

For example, the functions ƒ₁, ƒ₂ can be given as

ƒ₁ =a+b·number_of_logic_stages

ƒ₂ =a′+b′·number_of_ports

-   -   with technology dependent constants a, a′, b, b′. Other        implementations for the functions ƒ₁, ƒ₂ are possible. The        calculated width and height must be within the following bounds        for a given parameter α:

α < 1$\sqrt{\alpha \cdot {Area}} \leq {Height} \leq \sqrt{\frac{1}{\alpha} \cdot {Area}}$$\sqrt{\alpha \cdot {Area}} \leq {Width} \leq \sqrt{\frac{1}{\alpha} \cdot {Area}}$

For a macro which is dominated by a horizontal data flow, thecalculations are likewise. For a macro which is not clearly dominated bya horizontal or a vertical data flow (orthogonal data flow, combinedhorizontal and vertical data flow), the maximum dimension for eachdirection is calculated and bounds are used to limit the aspect ratiofor the macro.

The partitioning method of step 1260 is illustrated in FIG. 13. Afterthe completion of step 1210, or step 1240, or step 1250 (portallocation) respectively, then in step 1300 it will be determined, if apolygonal macro outline can be enforced for the macro by foreign objectsor if the polygonal macro outline can be optimized for macro area basedon logic depth binning. If this is not possible, then a list 1320 ofrectangles will be created in step 1300, which contains a singlerectangle only, which comprises the macro. Otherwise the list 1320 willbe created in step 1310 such that it also contains sub-rectangles inaddition to the rectangle. For both options of using either foreignobjects or logic depth binning the macro may be partitioned into two ormore rectangles in order to give it a polygonal outline.

The interaction with foreign objects is illustrated in FIG. 16. A macro1600 collides with a foreign object 1610, which represents an area,which is prohibited for the macro 1600. The macro 1600 and the foreignobject overlap in the area 1620. Therefore, this area 1620 needs to becutout from the macro 1600. This is achieved by adjusting the outline ofthe macro 1600 in order to preserve the area 1620 from the macro 1600.However, the space missing to the preservation of the area 1620 needs tobe compensated by using other areas. The areas 1630, 1640, and 1650 canbe used for the compensation. However, area 1630 is so small that it canonly be used for circuitry with a rather low logic depth. But the areas1640 and 1650 are large enough to be used for circuitry with higherlogic depth.

The logic depth binning is illustrated in FIG. 17. A macro 1700 has apolygonal shape and various ports 1710. For this macro 1700 tworectangles 1720 and 1730 are defined. These two rectangles 1720 and 1730are defined such that they contain circuitry with a maximum logic deptheach based on the cones of influence from input ports to output ports orvice versa. This is illustrated in FIG. 18. There is shown a macro 1800with input ports I1, I2, I3, I4, I5, I6 and output ports O1, O2, O3, O4,O5, O6. Input port I1 is connected to the output port O1, I2 to O2, I3to O2, I4 to O3, I5 to O5 and O4, and I6 to O6. This allows definingthree rectangles for the macro 1800: a rectangle with input ports I1 andI2 and output ports O1 and O2, a rectangle with input ports I3, I4 andoutput ports O3 and O4, and a rectangle with input ports I5 and I6 andoutput ports O5 and O6.

FIG. 19 illustrates the port allocation performed in steps 1240 and 1250of FIG. 12. The positions of an input port and an output port, which areconnected to each other, are chosen such that a minimum height isachieved for the outline of the macro. For the example shown in FIG. 19,input port I1 and output port O1 are allocated such that a logic depthof 9 fits between these ports, I2, O2 and O3 are located such that alogic depth of 6 fits between ports I2 and O2 and I2 and O3. Similarly,input ports I3 and I4 and output port O4 are located such that a logicdepth of 4 fits between ports O4 and I3 and O4 and I4, and therefore anaggregated logic depth of 6+4=10 is achieved, which means that the logicbetween I1 and O1 with logic depth 9 fits in the combined height. Theconnection between I1 and O1 has a distance weight of 9, between I2 andO2 it has a distance weight of 3, between I2 and O3 it has a distanceweight of 3, between I3 and O4 it has a distance weight of 2, andbetween I4 and O4 it has a distance weight of 2. The port allocationmethod described above ensures that a minimum distance is achievedrelatively between the input port I1, I2, I3, I4 and relatively betweenthe output ports O1, O2, O3, O4. Therefore, the input ports and theoutput ports are pulled together.

FIG. 20 illustrates a macro 2000 with input ports I1, I2, I3, I4, I5 andoutput ports O1, O2, O3, O4 after the port allocation. Input port I1 isconnected with output port O1, I2 with O2 and O3, I3 with O3, I4 with O4and O5, and I5 with O5. Ports I2, I3 and O5 are located within theoutline of the macro 2000. Therefore, the unused areas can be cutoffbased on the cones of influence. This results in the fractured outlineshown in FIG. 21. There a macro 2100 is shown, which results from themodifications of the outline from macro 2000 in FIG. 20.

As shown in FIG. 13, for each of the (sub-)rectangles in the list 1320it will be determined in step 1330 if its height is fixed. If the heightis not fixed, it will be calculated in step 1340. For this calculation,the area utilization and port bounds on the IC or chip will be takeninto consideration. Then in step 1350 it will be determined, if thewidth of the rectangle is fixed. If the width is not fixed, it will becalculated in step 1360. Then in step 1370 it will be checked if all(sub-)rectangles from the list 1320 were processed already. If not, thenthe next rectangle will be taken from the list 1320 and processed instep 1330. Otherwise the partitioning method is finished and theprocessing continues with step 1270 (likewise dimension) as shown inFIG. 12.

Generally, the method embodiments disclosed herein may be practiced witha general-purpose computer and the method embodiments may be coded as aset of instructions on removable or hard media for use by thegeneral-purpose computer. FIG. 11 is a schematic block diagram of ageneral-purpose computer suitable for practicing embodiments of thepresent invention. In FIG. 11, computer system 1100 has at least onemicroprocessor or central processing unit (CPU) 1105. CPU 1105 isinterconnected via a system bus 1110 to a random access memory (RAM)1115, a read-only memory (ROM) 1120, an input/output (I/O) adapter 1125for connecting a removable data and/or program storage device 1130 and amass data and/or program storage device 1135, a user interface adapter1140 for connecting a keyboard 1145 and a mouse 1150, a port adapter1155 for connecting a data port 1160 and a display adapter 1165 forconnecting a display device 1170.

ROM 1120 contains the basic operating system for computer system 1100.The operating system may alternatively reside in RAM 1115 or elsewhereas is known in the art. Examples of removable data and/or programstorage device 1130 include magnetic media such as floppy drives andtape drives and optical media such as CD ROM drives. Examples of massdata and/or program storage device 1135 include hard disk drives andnon-volatile memory such as flash memory. In addition to keyboard 1145and mouse 1150, other user input devices such as trackballs, writingtablets, pressure pads, microphones, light pens and position-sensingscreen displays may be connected to user interface 1140. Examples ofdisplay devices include cathode-ray tubes (CRT) and liquid crystaldisplays (LCD).

A computer program with an appropriate application interface may becreated by one of skill in the art and stored on the system or a dataand/or program storage device to simplify the practicing of thisinvention. In operation, information for or the computer program createdto run the present invention is loaded on the appropriate removable dataand/or program storage device 1130, fed through data port 1160 or typedin using keyboard 1145.

In view of the above, the present method embodiments may therefore takethe form of computer or controller implemented processes and apparatusesfor practicing those processes. The disclosure can also be embodied inthe form of computer program code containing instructions embodied intangible media, such as floppy diskettes, CD-ROMs, hard drives, or anyother computer-readable storage medium, wherein, when the computerprogram code is loaded into and executed by a computer or controller,the computer becomes an apparatus for practicing the invention. Thedisclosure may also be embodied in the form of computer program code orsignal, for example, whether stored in a storage medium, loaded intoand/or executed by a computer or controller, or transmitted over sometransmission medium, such as over electrical wiring or cabling, throughfiber optics, or via electromagnetic radiation, wherein, when thecomputer program code is loaded into and executed by a computer, thecomputer becomes an apparatus for practicing the invention. Whenimplemented on a general-purpose microprocessor, the computer programcode segments configure the microprocessor to create specific logiccircuits. A technical effect of the executable instructions is toimplement the embodiments of the method described above and illustratedin FIGS. 12 and 13.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the invention. Asused herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of oneor more other features, integers, steps, operations, elements,components, and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present invention has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the invention in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the invention. Theembodiment was chosen and described in order to best explain theprinciples of the invention and the practical application, and to enableothers of ordinary skill in the art to understand the invention forvarious embodiments with various modifications as are suited to theparticular use contemplated.

The flow diagrams depicted herein are just one example. There may bemany variations to this diagram or the steps (or operations) describedtherein without departing from the spirit of the invention. Forinstance, the steps may be performed in a differing order or steps maybe added, deleted or modified. All of these variations are considered apart of the claimed invention.

While the preferred embodiments to the invention have been described, itwill be understood that those skilled in the art, both now and in thefuture, may make various improvements and enhancements which fall withinthe scope of the claims which follow. These claims should be construedto maintain the proper protection for the invention first described.

1. A computer implemented method for placement of random logic macros ofan electronic circuit design, wherein said macros comprise any one of afixed outline shape or a modifiable outline shape, the methodcomprising: modifying by the computer, an outline of a modifiableoutline shape macro based on criteria consisting of any one of a macroport weight value, a macro port ordering; a macro rapport constraint ora macro logic depth; and placing the modified modifiable outline shapemacro at a location on an integrated circuit (chip).
 2. The method ofclaim 1, wherein a modifiable outline shape macro has any one of arectangular shape or a polygonal shape.
 3. The method according to claim2, further comprising: selecting and categorizing a macro from a netlistas the modifiable outline shape macro; and partitioning the selectedmodifiable outline shape macro.
 4. The method of claim 3, furthercomprising: allocating ports of the modifiable outline shape macro. 5.The method of according to claim 4, further comprising: comparing thedimensions of the modifiable outline shape macro with another macrohaving a fixed outline shape in vicinity of the modifiable outline shapemacro; and placing the ports of the modifiable outline shape macro suchthat a rapport is formed with the another macro.
 6. The method accordingclaim 5, further comprising logically partitioning the modifiableoutline shape macro into a plurality of rectangular macros, eachrectangular macro having allocated ports of the modifiable outline shapemacro.
 7. A computer program product for placement of random logicmacros of an electronic circuit design, wherein said macros comprise anyone of a fixed outline shape or a modifiable outline shape, the computerprogram product comprising a computer readable storage medium storinginstructions for performing a method comprising: modifying by thecomputer, an outline of a modifiable outline shape macro based oncriteria consisting of any one of a macro port weight value, a macroport ordering; a macro rapport constraint or a macro logic depth; andplacing the modified modifiable outline shape macro at a location on anintegrated circuit (chip).
 8. The computer program product of claim 7,wherein a modifiable outline shape macro has any one of a rectangularshape or a polygonal shape.
 9. The computer program product according toclaim 8, further comprising: selecting and categorizing a macro from anetlist as the modifiable outline shape macro; and partitioning theselected modifiable outline shape macro.
 10. The computer programproduct of claim 9, further comprising: allocating ports of themodifiable outline shape macro.
 11. The computer program product ofaccording to claim 10, further comprising: comparing the dimensions ofthe modifiable outline shape macro with another macro having a fixedoutline shape in vicinity of the modifiable outline shape macro; andplacing the ports of the modifiable outline shape macro such that arapport is formed with the another macro.
 12. The computer programproduct according claim 11 further comprising logically partitioning themodifiable outline shape macro into a plurality of rectangular macros,each rectangular macro having allocated ports of the modifiable outlineshape macro.
 13. A system for placement of random logic macros of anelectronic circuit design, wherein said macros comprise any one of afixed outline shape or a modifiable outline shape, the systemcomprising: a memory; and a processor communicatively connected to saidmemory, the system configured to perform a method comprising: modifyingby the computer, an outline of a modifiable outline shape macro based oncriteria consisting of any one of a macro port weight value, a macroport ordering; a macro rapport constraint or a macro logic depth; andplacing the modified modifiable outline shape macro at a location on anintegrated circuit (chip).
 14. The system of claim 13, wherein amodifiable outline shape macro has any one of a rectangular shape or apolygonal shape.
 15. The system according to claim 14, furthercomprising: selecting and categorizing a macro from a netlist as themodifiable outline shape macro; and partitioning the selected modifiableoutline shape macro.
 16. The system of claim 15, further comprising:allocating ports of the modifiable outline shape macro.
 17. The systemof according to claim 16, further comprising: comparing the dimensionsof the modifiable outline shape macro with another macro having a fixedoutline shape in vicinity of the modifiable outline shape macro; andplacing the ports of the modifiable outline shape macro such that arapport is formed with the another macro.
 18. The system according claim17, further comprising logically partitioning the modifiable outlineshape macro into a plurality of rectangular macros, each rectangularmacro having allocated ports of the modifiable outline shape macro. 19.The method according to claim 1, comprising: based on cones of influenceof input ports to output ports, binning logic of the modifiable outlineshape macro into two or more rectangles, each rectangle comprisingcircuits having logic depth less than a logic depth assigned to therectangle; and arranging the two or more rectangles to form the modifiedoutline shape macro comprising.
 20. The computer program productaccording to claim 7, comprising: based on cones of influence of inputports to output ports, binning logic of the modifiable outline shapemacro into two or more rectangles, each rectangle comprising circuitshaving logic depth less than a logic depth assigned to the rectangle;and arranging the two or more rectangles to form the modified outlineshape macro comprising.